The Expected Competitive Ratio on a Kind of Stochastic-Online Flowtime Scheduling with Machine Subject to an Uncertain Breakdown

We consider the problem of scheduling jobs on a single machine subject to an uncertain breakdown minimize flowtime. Assuming is unavailable during breakdown, starting time random variable s with distribution function D(s) and terminating has no any other information; are non-resumable. Under these assumptions from perspective statistical optimization, we first establish HSONRP, which contains deterministic information, stochastic online information then define expected competitive ratio algorithm find optimized solution HSONRP. In addition, then, propose prove certain results SPT rule. particular, rule less than 1+max{pi}2P when uniform interval (0,P], where pi processing job i, P=∑i=1npi, show that it more 54 under quite loose condition. Meanwhile, also make some discussions about our studies. What have performed will enrich improve research area flowtime advance development optimization optimization.